A simpler characterization of a spectral lower bound on the clique number

Given a simple, undirected graph G, Budinich (Discret Appl Math 127:535-543, 2003) proposed a lower bound on the clique number of G by combining the quadratic programming formulation of the clique number due to Motzkin and Straus (Can J Math 17:533-540, 1965) with the spectral decomposition of the adjacency matrix of G. This lower bound improves the previously known spectral lower bounds on the clique number that rely on the Motzkin-Straus formulation. In this paper, we give a simpler, alternative characterization of this lower bound. For regular graphs, this simpler characterization allows us to obtain a simple, closed-form expression of this lower bound as a function of the positive eigenvalues of the adjacency matrix. Our computational results shed light on the quality of this lower bound in comparison with the other spectral lower bounds on the clique number. © Springer-Verlag 2009

A hierarchical solution approach for a multicommodity distribution problem under a special cost structure

Motivated by the spare parts distribution system of a major automotive manufacturer in Turkey, we consider a multicommodity distribution problem from a central depot to a number of geographically dispersed demand points. The distribution of the items is carried out by a set of identical vehicles. The demand of each demand point can be satisfied by several vehicles and a single vehicle is allowed to serve multiple demand points. For a given vehicle, the cost structure is dictated by the farthest demand point from the depot among all demand points served by that vehicle. The objective is to satisfy the demand of each demand point with the minimum total distribution cost. We present a novel integer linear programming formulation of the problem as a variant of the network design problem. The resulting optimization problem becomes computationally infeasible for real-life problems due to the large number of integer variables. In an attempt to circumvent this disadvantage of using the direct formulation especially for larger problems, we propose a Hierarchical Approach that is aimed at solving the problem in two stages using partial demand aggregation followed by a disaggregation scheme. We study the properties of the solution returned by the Hierarchical Approach. We perform computational studies on a data set adapted from a major automotive manufacturer in Turkey. Our results reveal that the Hierarchical Approach significantly outperforms the direct formulation approach in terms of both the running time and the quality of the resulting solution especially on large instances. © 2012 Elsevier Ltd. All rights reserved

Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension

We implement several warm-start strategies in interior-point methods for linear programming (LP). We study the situation in which both the original LP instance and the perturbed one have exactly the same dimensions. We consider different types of perturbations of data components of the original instance and different sizes of each type of perturbation. We modify the state-of-the-art interior-point solver PCx in our implementation. We evaluate the effectiveness of each warm-start strategy based on the number of iterations and the computation time in comparison with "cold start" on the NETLIB test suite. Our experiments reveal that each of the warm-start strategies leads to a reduction in the number of interior-point iterations especially for smaller perturbations and for perturbations of fewer data components in comparison with cold start. On the other hand, only one of the warm-start strategies exhibits better performance than cold start in terms of computation time. Based on the insight gained from the computational results, we discuss several potential improvements to enhance the performances of such warm-start strategies. © 2007 Springer Science+Business Media, LLC

Computing minimum-volume enclosing axis-aligned ellipsoids

Given a set of points S = {x1 ,..., xm}⊂ ℝn and ε>0, we propose and analyze an algorithm for the problem of computing a (1+ε)-approximation to the minimum-volume axis-aligned ellipsoid enclosing S. We establish that our algorithm is polynomial for fixed ε. In addition, the algorithm returns a small core set X ⊆ S, whose size is independent of the number of points m, with the property that the minimum-volume axis-aligned ellipsoid enclosing X is a good approximation of the minimum-volume axis-aligned ellipsoid enclosing S. Our computational results indicate that the algorithm exhibits significantly better performance than the theoretical worst-case complexity estimate. © 2007 Springer Science+Business Media, LLC

On extracting maximum stable sets in perfect graphs using Lovász's theta function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. © 2006 Springer Science + Business Media, Inc

Extreme Electron-Phonon Coupling in Boron-based Layered Superconductors

The phonon-mode decomposition of the electron-phonon coupling in the MgB2-like system Li_{1-x}BC is explored using first principles calculations. It is found that the high temperature superconductivity of such systems results from extremely strong coupling to only ~2% of the phonon modes. Novel characteristics of E_2g branches include (1) ``mode lambda'' values of 25 and greater compared to a mean of $\sim 0.4$ for other modes, (2) a precipitous Kohn anomaly, and (3) E_2g phonon linewidths within a factor of ~2 of the frequency itself, indicating impending breakdown of linear electron-phonon theory. This behavior in borne out by recent inelastic x-ray scattering studies of MgB2 by Shukla et al.Comment: 4 two-column pages, 4 figures. Equations simplified. Figure 4 changed. Comparison with new data include

Fermi Surfaces of Diborides: MgB2 and ZrB2

We provide a comparison of accurate full potential band calculations of the Fermi surfaces areas and masses of MgB2 and ZrB2 with the de Haas-van Alphen date of Yelland et al. and Tanaka et al., respectively. The discrepancies in areas in MgB2 can be removed by a shift of sigma-bands downward with respect to pi-bands by 0.24 eV. Comparison of effective masses lead to orbit averaged electron-phonon coupling constants lambda(sigma)=1.3 (both orbits), lambda(pi)=0.5. The required band shifts, which we interpret as an exchange attraction for sigma states beyond local density band theory, reduces the number of holes from 0.15 to 0.11 holes per cell. This makes the occurrence of superconductivity in MgB2 a somewhat closer call than previously recognized, and increases the likelihood that additional holes can lead to an increased Tc.Comment: 7 pages including 4 figure

Upper critical field in dirty two-band superconductors: breakdown of the anisotropic Ginzburg-Landau theory

We investigate the upper critical field in a dirty two-band superconductor within quasiclassical Usadel equations. The regime of very high anisotropy in the quasi-2D band, relevant for MgB$_{2}$, is considered. We show that strong disparities in pairing interactions and diffusion constant anisotropies for two bands influence the in-plane $H_{c2}$ in a different way at high and low temperatures. This causes temperature-dependent $H_{c2}$ anisotropy, in accordance with recent experimental data in MgB$_{2}$. The three-dimensional band most strongly influences the in-plane $H_{c2}$ near $T_{c}$, in the Ginzburg-Landau (GL) region. However, due to a very large difference between the c-axis coherence lengths in the two bands, the GL theory is applicable only in an extremely narrow temperature range near $T_c$. The angular dependence of $H_{c2}$ deviates from a simple effective-mass law even near $T_c$.Comment: 12 pages, 5 figures, submitted to Phys.Rev.

Search for a W' boson decaying to a bottom quark and a top quark in pp collisions at sqrt(s) = 7 TeV

Results are presented from a search for a W' boson using a dataset corresponding to 5.0 inverse femtobarns of integrated luminosity collected during 2011 by the CMS experiment at the LHC in pp collisions at sqrt(s)=7 TeV. The W' boson is modeled as a heavy W boson, but different scenarios for the couplings to fermions are considered, involving both left-handed and right-handed chiral projections of the fermions, as well as an arbitrary mixture of the two. The search is performed in the decay channel W' to t b, leading to a final state signature with a single lepton (e, mu), missing transverse energy, and jets, at least one of which is tagged as a b-jet. A W' boson that couples to fermions with the same coupling constant as the W, but to the right-handed rather than left-handed chiral projections, is excluded for masses below 1.85 TeV at the 95% confidence level. For the first time using LHC data, constraints on the W' gauge coupling for a set of left- and right-handed coupling combinations have been placed. These results represent a significant improvement over previously published limits.Comment: Submitted to Physics Letters B. Replaced with version publishe